Weighted Languages Recognizable by Weighted Tree Automata
نویسندگان
چکیده
منابع مشابه
Weighted Tree-Walking Automata
We define weighted tree-walking automata. We show that the class of tree series recognizable by weighted tree-walking automata over a commutative semiring K is a subclass of the class of regular tree series over K. If K is not a ring, then the inclusion is strict.
متن کاملLocal Weighted Tree Languages
Local weighted tree languages over semirings are introduced. For an arbitrary semiring, a weighted tree language is shown to be recognizable iff it appears as the image of a local weighted tree language under a deterministic relabeling.
متن کاملLanguages Accepted by Integer Weighted Finite Automata
We study the family of languages accepted by the integer weighted nite automata. Especially the closure properties of this family are investigated.
متن کاملPushing for Weighted Tree Automata
A weight normalization procedure, commonly called pushing, is introduced for weighted tree automata (wta) over commutative semifields. The normalization preserves the recognized weighted tree language even for nondeterministic wta, but it is most useful for bottom-up deterministic wta, where it can be used for minimization and equivalence testing. In both applications a careful selection of the...
متن کاملMinimizing Deterministic Weighted Tree Automata
The problem of efficiently minimizing deterministic weighted tree automata (wta) is investigated. Such automata have found promising applications as language models in Natural Language Processing. A polynomial-time algorithm is presented that given a deterministic wta over a commutative semifield, of which all operations including the computation of the inverses are polynomial, constructs an eq...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Cybernetica
سال: 2018
ISSN: 0324-721X
DOI: 10.14232/actacyb.23.3.2018.9